The problem of constrained judgment aggregation
نویسنده
چکیده
Group decisions must often obey exogenous constraints. While in a preference aggregation problem constraints are modelled by restricting the set of feasible alternatives, this paper addresses the modelling of constraints when aggregating individual yes/no judgments on interconnected propositions. For example, court judgments in breach-of-contract cases should respect the constraint that action and obligation are necessary and sufficient for liability, and judgments on budget items should respect budgetary constraints. In this paper, we make constraints in judgment aggregation explicit by relativizing the rationality conditions of consistency and deductive closure to a constraint set, whose variation yields more or less strong notions of rationality. This approach of explicit constraints contrasts with that of building constraints as axioms into the logic, which turns compliance with constraints into a matter of logical consistency and thereby conflates requirements of ordinary logical consistency (such as not to affirm a proposition and also its negation) and requirements dictated by the environment (such as budget constraints). We present some general impossibility results on constrained judgment aggregation; they are immediate corollaries of known results on (unconstrained) judgment aggregation.
منابع مشابه
From Preferences to Judgments and Back
The paper studies the interrelationships of the Preference Aggregation and Judgment Aggregation problems from the point of view of logical semantics. The result of the paper is twofold. On the one hand, the Preference Aggregation problem is viewed as a special case of the Judgment Aggregation one. On the other hand, the Judgment Aggregation problem is viewed as a special case of the Preference ...
متن کاملA Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)
Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...
متن کاملAggregating Causal Judgments
Decision-making typically requires judgments about causal relations: we need to know the causal e§ects of our actions and the causal relevance of various environmental factors. We investigate how several individualsí causal judgments can be aggregated into collective causal judgments. First, we consider the aggregation of causal judgments via the aggregation of probabilistic judgments, and iden...
متن کاملThe Exact Solution of Min-Time Optimal Control Problem in Constrained LTI Systems: A State Transition Matrix Approach
In this paper, the min-time optimal control problem is mainly investigated in the linear time invariant (LTI) continuous-time control system with a constrained input. A high order dynamical LTI system is firstly considered for this purpose. Then the Pontryagin principle and some necessary optimality conditions have been simultaneously used to solve the optimal control problem. These optimality ...
متن کاملComplexity of Judgment Aggregation
We analyse the computational complexity of three problems in judgment aggregation: (1) computing a collective judgment from a profile of individual judgments (the winner determination problem); (2) deciding whether a given agent can influence the outcome of a judgment aggregation procedure in her favour by reporting insincere judgments (the strategic manipulation problem); and (3) deciding whet...
متن کامل